Modular Termination of Graph Transformation
نویسنده
چکیده
We establish a machine-checkable condition which ensures that the union of two terminating hypergraph transformation systems is terminating. The condition is based on so-called sequential critical pairs which represent consecutive rule applications that are not independent. In contrast to a corresponding modularity result for term rewriting, no restrictions on the form of rules are required. Our result applies to both systems with injective rules and systems with rules that merge nodes or edges.
منابع مشابه
Fixed points for Banach and Kannan contractions in modular spaces with a graph
In this paper, we discuss the existence and uniqueness of xed points for Banach and Kannancontractions dened on modular spaces endowed with a graph. We do not impose the Δ2-conditionor the Fatou property on the modular spaces to give generalizations of some recent results. Thegiven results play as a modular version of metric xed point results.
متن کاملTermination Analysis for Graph Transformation Systems
We introduce two techniques for proving termination of graph transformation systems. We do not fix a single initial graph, but consider arbitrary initial graphs (uniform termination), but also certain sets of initial graphs (non-uniform termination). The first technique, which can also be used to show non-uniform termination, uses a weighted type graph to assign weights to graphs. The second te...
متن کاملExecution Properties of a Visual Control Flow Language
Graph rewriting-based model processing is a widely used technique for model transformation. Especially visual model transformations can be expressed by graph transformations, since graphs are well-suited to describe the underlying structures of graphical models. Model transformations often need to follow an algorithm that requires a strict control over the execution sequence of the transformati...
متن کاملTermination of High-Level Replacement Units with Application to Model Transformation
Visual rewriting techniques are increasingly used to model transformations of systems speci ed through diagrammatic sentences. Graph transformations, in particular, are a widespread formalism with several applications, from parsing to model animation or transformation. Although a wealth of rewriting models have been proposed, di ering in the expressivity of the types of rules and in the complex...
متن کاملTowards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite ‘creation chains’, that is chains of edges in different graphs of the reduction sequence, such that each edge is involved in creating the next edge. In our approach, the length of such creation chains is recorded by associating with eac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018